LEARNING CIRCUITS AND NETWORKS BY INJECTING VALUES 1

Source URL: www.levreyzin.com

• Computational complexity theory
• Theory of computation
• Theoretical computer science
• Circuit complexity
• Complexity classes
• Logic in computer science
• Clique problem
• Boolean circuit
• Clique
• Circuit
• ACC0
• NC

c Cambridge University Press 2009 JFP: page 1 of 24.  1 doi:S0956796809990219

Source URL: www.cs.ioc.ee

• Logic in computer science
• Programming language semantics
• Models of computation
• Computability theory
• Logic programming
• Substitution
• Operational semantics
• Denotational semantics
• Lambda calculus
• Structure

Automatic Modular Abstractions for Template Numerical Constraints∗ David Monniaux† May 26, 2010 Abstract

Source URL: www-verimag.imag.fr

• Logic
• Mathematics
• Mathematical logic
• Model theory
• Quantification
• Metalogic
• Predicate logic
• Logic in computer science
• Quantifier elimination
• Abstract interpretation
• Quantifier
• FO

Logic for Automated Mechanism Design — A Progress Report Michael Wooldridge∗ Thomas Agotnes† ∗

Source URL: folk.uib.no

• Game theory
• Artificial intelligence
• Formal epistemology
• Modal logic
• Logic in computer science
• Common knowledge
• Epistemic modal logic
• Intelligent agent
• Alternating-time Temporal Logic
• Temporal logic
• Social software
• Mechanism design

Rewriting, Inference, and Proof? Appears in the Proceedings of the 8th Workshop on Rewriting Logic and its Applications, 2010 Natarajan Shankar1 Computer Science Laboratory

Source URL: www.csl.sri.com

Denotational semantics for lazy initialization of letrec black holes as exceptions rather than divergence Keiko Nakata Institute of Cybernetics at Tallinn University of Technology Abstract We present a denotational seman

Source URL: www.cs.ioc.ee

• Theoretical computer science
• Models of computation
• Mathematical logic
• Software engineering
• Computability theory
• Denotational semantics
• Logic in computer science
• Lambda calculus
• Substitution
• Function type

A comparative study of programmer-written and automatically inferred contracts Nadia Polikarpova, Ilinca Ciupa, Bertrand Meyer Chair of Software Engineering, ETH Zurich, Switzerland {firstname.lastname}@inf.ethz.ch

Source URL: se.ethz.ch

• Software engineering
• Computer programming
• Software
• Formal methods
• Logic in computer science
• Object-oriented programming languages
• Object-oriented programming
• Software testing
• Postcondition
• Eiffel
• Assertion
• Class invariant

M EMORAX, a precise and sound tool for automatic fence insertion under TSO ? Parosh Aziz Abdulla1 , Mohamed Faouzi Atig1 , Yu-Fang Chen2 , Carl Leonardsson1 , and Ahmed Rezine3 1

Source URL: user.it.uu.se

• Theoretical computer science
• Mathematics
• Finite automata
• Computing
• Theory of computation
• Formal methods
• Reachability problem
• Logic in computer science
• Model checking
• Memory barrier
• Preorder
• Algorithm

JMLR: Workshop and Conference Proceedings vol 40:1–21, 2015 Second-order Quantile Methods for Experts and Combinatorial Games Wouter M. Koolen

Source URL: jmlr.org

• Statistics
• Combinatory logic
• Lambda calculus
• Logic in computer science
• Principal component analysis
• Theoretical computer science
• Mathematics

CTP-based programming languages ? Considerations about an experimental design Florian Haftmann Cezary Kaliszyk

Source URL: dream.inf.ed.ac.uk

• Theoretical computer science
• Automated theorem proving
• Logic in computer science
• Proof assistants
• Formal methods
• Isabelle
• Type theory
• HOL
• Automated reasoning
• Computer algebra system
• Vienna Development Method
• Software development